A new algorithm of the scheduling of a flexible manufacturing system based on genetic algorithm
نویسندگان
چکیده
In the flexible manufacturing system, a reasonable production scheduling is crucial in shortening processing completion time and improving equipment utilization. Traditional manual cannot effectively solve complex workshop problems provide solution that meets requirements short period of time, which can lead to decrease efficiency. Aiming at job shop problem, genetic algorithm used find optimal this study, taking number overdue jobs, total comprehensive load rate maximum machine tool as performance indicators algorithm. The chromosomes are designed process gene chain improve diversity robustness chromosome through crossover, variation, selection other processes. impact different parameter settings on each researched by adjusting four algorithm-related parameters, there has been certain improvement results problems. This study provides reference for design optimization based
منابع مشابه
Real-time Scheduling of a Flexible Manufacturing System using a Two-phase Machine Learning Algorithm
The static and analytic scheduling approach is very difficult to follow and is not always applicable in real-time. Most of the scheduling algorithms are designed to be established in offline environment. However, we are challenged with three characteristics in real cases: First, problem data of jobs are not known in advance. Second, most of the shop’s parameters tend to be stochastic. Third, th...
متن کاملRole of batch size in scheduling optimization of flexible manufacturing system using genetic algorithm
Flexible manufacturing system (FMS) readily addresses the dynamic needs of the customers in terms of variety and quality. At present, there is a need to produce a wide range of quality products in limited time span. On-time delivery of customers’ orders is critical in make-to-order (MTO) manufacturing systems. The completion time of the orders depends on several factors including arrival rate, ...
متن کاملA HYBRID GENETIC ALGORITHM FOR A BI-OBJECTIVE SCHEDULING PROBLEM IN A FLEXIBLE MANUFACTURING CELL
This paper considers a bi-objective scheduling problem in a flexible manufacturing cell (FMC) which minimizes the maximum completion time (i.e., makespan) and maximum tardiness simultaneously. A new mathematical model is considered to reflect all aspect of the manufacturing cell. This type of scheduling problem is known to be NP-hard. To cope with the complexity of such a hard problem, a genet...
متن کاملScheduling of flexible manufacturing systems using genetic algorithm: A heuristic approach
Scheduling of production in Flexible Manufacturing Systems (FMSs) has been extensively investigated over the past years and it continues to attract the interest of both academic researchers and practitioners. The generation of new and modified production schedules is becoming a necessity in today’s complex manufacturing environment. Genetic algorithms are used in this paper to obtain an initial...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Manufacturing review
سال: 2023
ISSN: ['2265-4224']
DOI: https://doi.org/10.1051/mfreview/2023010